On Factoring Arbitrary Integers with Known Bits
نویسندگان
چکیده
We study the factoring with known bits problem, where we are given a composite integer N = p1p2 . . . pr and oracle access to the bits of the prime factors pi, i = 1, . . . , r. Our goal is to find the full factorization of N in polynomial time with a minimal number of calls to the oracle. We present a rigorous algorithm that efficiently factors N given (1− 1 r Hr) log N bits, where Hr denotes the r harmonic number.
منابع مشابه
Factoring Small Integers: An Experimental Comparison
In this data-based paper we report on our experiments in factoring integers from 50 to 200 bits with the postsieving phase of NFS as a potential application. We implemented and compared several general-purpose factoring algorithms suited for these smaller numbers, from Shanks’s square form factorization method to the self-initializing quadratic sieve, and revisited the older continued fraction ...
متن کاملQuantum algorithms for computing short discrete logarithms and factoring RSA integers
In this paper we generalize the quantum algorithm for computing short discrete logarithms previously introduced by Eker̊a [2] so as to allow for various tradeoffs between the number of times that the algorithm need be executed on the one hand, and the complexity of the algorithm and the requirements it imposes on the quantum computer on the other hand. Furthermore, we describe applications of al...
متن کاملQuantum Algorithms for Computing Short Discrete Logarithms and Factoring RSA Integers
In this paper we generalize the quantum algorithm for computing short discrete logarithms previously introduced by Eker̊a [2] so as to allow for various tradeoffs between the number of times that the algorithm need be executed on the one hand, and the complexity of the algorithm and the requirements it imposes on the quantum computer on the other hand. Furthermore, we describe applications of al...
متن کاملSolving Linear Equations Modulo Divisors: On Factoring Given Any Bits
We study the problem of finding solutions to linear equations modulo an unknown divisor p of a known composite integer N . An important application of this problem is factorization of N with given bits of p. It is well-known that this problem is polynomial-time solvable if at most half of the bits of p are unknown and if the unknown bits are located in one consecutive block. We introduce an heu...
متن کاملFactorization-Based Fail-Stop Signatures Revisited
Fail-stop signature (FSS) schemes are important primitives because in a fail-stop signature scheme the signer is protected against unlimited powerful adversaries as follows: Even if an adversary breaks the scheme’s underlying computational hard problem and hence forges a signature, then with overwhelming probability the signer is able to prove that a forgery has occurred (i.e. that the underlyi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007